The free uniform spanning forest (FUSF) of an infinite connected graph G is obtained as the weak limit of uniformly chosen spanning trees of finite subgraphs of G. It is easy to see that the FUSF is supported on spanning … Continue reading Colloquium: Tuesday, June 14, 2 pm. Speaker: Asaf Nachmias (Tel Aviv). Title: “The connectivity of the uniform spanning forest on planar graphs”.